Existence and Uniqueness of Infinite Components in Generic Rigidity Percolation

نویسنده

  • Alexander E. Holroyd
چکیده

We consider a percolation configuration on a general lattice in which edges are included independently with probability p. We study the rigidity properties of the resulting configuration, in the sense of generic rigidity in d dimensions. We give a mathematically rigorous treatment of the problem, starting with a definition of an infinite rigid component. We prove that for a broad class of lattices, there exists an infinite rigid component for some p strictly below unity. For the particular case of two-dimensional rigidity on the two-dimensional triangular lattice, we prove firstly that the critical probability for rigidity percolation lies strictly above that for connectivity percolation, and secondly that the infinite rigid component (when it exists) is unique for all but countably many values of p. We conjecture that this uniqueness in fact holds for all p. Some of our arguments could be applied to two-dimensional lattices in more generality.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Uniqueness and non-uniqueness in percolation theory

This paper is an up-to-date introduction to the problem of uniqueness versus non-uniqueness of infinite clusters for percolation on Z d and, more generally, on transitive graphs. For iid percolation on Z, uniqueness of the infinite cluster is a classical result, while on certain other transitive graphs uniqueness may fail. Key properties of the graphs in this context turn out to be amenability ...

متن کامل

Uniqueness and multiplicity of infinite clusters

The Burton–Keane theorem for the almost-sure uniqueness of infinite clusters is a landmark of stochastic geometry. Let μ be a translationinvariant probability measure with the finite-energy property on the edge-set of a d-dimensional lattice. The theorem states that the number I of infinite components satisfies μ(I ∈ {0, 1}) = 1. The proof is an elegant and minimalist combination of zero–one ar...

متن کامل

Percolation on dual lattices with k-fold symmetry

Zhang found a simple, elegant argument deducing the non-existence of an infinite open cluster in certain lattice percolation models (for example, p = 1/2 bond percolation on the square lattice) from general results on the uniqueness of an infinite open cluster when it exists; this argument requires some symmetry. Here we show that a simple modification of Zhang’s argument requires only 2-fold (...

متن کامل

Entanglement in Percolation

We study the existence of finite and infinite entangled graphs in the bond percolation process in three dimensions with density p. After a discussion of the relevant definitions, the entanglement critical probabilities are defined. The size of the maximal entangled graph at the origin is studied for small p, and it is shown that this graph has radius whose tail decays at least as fast as exp(−α...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998